The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n)
نویسندگان
چکیده
We present a short proof of Füredi’s theorem [F] stated in the title.
منابع مشابه
Directed domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملThe Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdős and Moser conjectured that this function is linear. Supporting this conjecture we prove that f (n) ∼ 2n where f (n) is the restriction of f (n) to centrally symmetric convex n-gons. We also present two applications of this result. Given a strictly convex domain K with smooth boundary, if fK (n) ...
متن کاملOn Isosceles Triangles and Related Problems in a Convex Polygon
Given any convex n-gon, in this article, we: (i) prove that its vertices can form at most n2/2 + Θ(n log n) isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most 3n2/4 + o(n2) isosceles triangles and prove this conjecture for a special group of convex n-gons, (iii) prove that its vertices can f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 94 شماره
صفحات -
تاریخ انتشار 2001